منابع مشابه
Petri Games are Monotonic but Difficult to Decide?
In this paper, we study two-player games played on infinite but monotonic game structures. We concentrate on coverability games, a natural subclass of reachability games in the context of monotonic game structures. On the negative side, we show that surprisingly, and contrary to the one-player case, coverability is undecidable on two-player monotonic game structures. On the positive side, we id...
متن کاملPartition games are pure breaking games
Taking-and-breaking games are combinatorial games played on heaps of tokens, where both players are allowed to remove tokens from a heap and/or split a heap into smaller heaps. Subtraction games, octal and hexadecimal games are well-known families of such games. We here consider the set of pure breaking games, that correspond to the family of taking-and-breaking games where splitting heaps only...
متن کاملDamaged BZip Files Are Difficult to Repair
bzip is a program written by Julian Seward that is often used under Unix to compress single files. It splits the file into blocks which are compressed individually using a combination of the Burrows-Wheeler-Transformation, the Move-To-Front algorithm, Huffman and Runlength encoding. The author himself stated that compressed blocks that are damaged, i.e., part of which are lost, are essentially ...
متن کاملWhich graphical models are difficult to learn?
We consider the problem of learning the structure of Ising models (pairwise binary Markov random fields) from i.i.d. samples. While several methods have been proposed to accomplish this task, their relative merits and limitations remain somewhat obscure. By analyzing a number of concrete examples, we show that low-complexity algorithms systematically fail when the Markov random field develops l...
متن کاملSparse Games Are Hard
A two-player game is sparse if most of its payoff entries are zeros. We show that the problem of computing a Nash equilibrium remains PPAD-hard to approximate in fully polynomial time for sparse games. On the algorithmic side, we give a simple and polynomial-time algorithm for finding exact Nash equilibria in a class of sparse win-lose games.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1993
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90185-v